computational complexity theory - PDFSEARCH.IO - Document Search Engine

computational complexity theory
Results: 2049

#	Item
91	Genomes containing Duplicates are Hard to compare (Extended Abstract)? Cedric Chauve1 , Guillaume Fertin2 , Romeo Rizzi3 , and St´ephane Vialette4 ` Montr´eal LaCIM et D´epartement d’Informatique, Universit´e du Qu Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:57:00 Biology Genomics Computational complexity theory Bioinformatics MAX-3SAT Comparative genomics Genome Gene Vertex cover
92	QCSP on partially reflexive forests Barnaby Martin? School of Engineering and Computing Sciences, Durham University Science Labs, South Road, Durham, DH1 3LE, UK Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-04-01 20:03:12 Graph theory Mathematics Computational complexity theory Morphisms Graph coloring Tree Reduction Isomorphism Homomorphism Grushko theorem
93	Proofs of Restricted Shuﬄes Bj¨ orn Terelius and Douglas Wikstr¨om CSC KTH Stockholm, Sweden {terelius,dog}@csc.kth.se Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 08:55:25 Mathematics Cryptography Algebra Permutations Polynomials Computational complexity theory Proof of knowledge IP Permutation matrix SchwartzZippel lemma NP Permutation
94	LNCSParallel Repetition of Computationally Sound Protocols Revisited Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 08:49:12 Computational complexity theory Theory of computation Cryptography Complexity classes Quantum complexity theory IP Proof of knowledge NP PP XTR PSPACE Communications protocol
95	Synchronous Counting and Computational Algorithm Design Danny Dolev School of Engineering and Computer Science, The Hebrew University of Jerusalem Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-09-16 05:51:42 Computing Edsger W. Dijkstra Mathematics Computational complexity theory Theoretical computer science Distributed computing Consensus Algorithm Randomized algorithm Distributed algorithm Counter Leader election
96	A Sufficient Condition for Polynomial Distribution-Dependent Learnability Martin Anthony Department of Mathematics London School of Economics Houghton Street Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2000-04-03 14:26:58 Computational learning theory Machine learning Learning Theoretical computer science Cognition Probably approximately correct learning Sample complexity VC dimension Mode Occam learning Error Tolerance
97	Introduction & Motivation Relations and Operations Boolean and 3-element cases Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-08-14 00:50:42 Computational complexity theory Complexity classes Theory of computation FO PSPACE SO P EXPTIME Boolean algebra Co-NP-complete Reduction Descriptive complexity theory
98	Simple Extractors for All Min-Entropies and a New Pseudorandom Generator∗ Ronen Shaltiel † Christopher Umans ‡ Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2004-12-08 14:14:59 Cryptography Theoretical computer science Computational complexity theory Theory of computation Pseudorandomness Random number generation Randomness Randomness extractor Pseudorandom generator Extractor Advice List decoding
99	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:12 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization NP-hard problems Approximation algorithms Edsger W. Dijkstra Travelling salesman problem Nearest neighbour algorithm Shortest path problem Maximal independent set
100	Page Migration with Limited Local Memory Capacity Susanne Albers? Hisashi Koga?? Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2013-11-25 11:07:00 Computational complexity theory Mathematics Graph theory Analysis of algorithms Online algorithms Edsger W. Dijkstra Network theory Probabilistic complexity theory Randomized algorithm Algorithm Distributed computing Shortest path problem

UPDATE